Polynomial programming prevents aircraft (and other) conflicts

نویسندگان

چکیده

Using a known algebraic result, we obtain finite polynomial programming reformulation of semi-infinite program modeling the aircraft deconfliction problem via subliminal speed regulation. Solving yields better results than state art for most tested instances.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Metrics for Tactical Aircraft to Aircraft Conflicts

An air traffic control system’s main function is to separate aircraft. The computer supporting the system assists the air traffic controllers by generating a conflict alert whenever it predicts that two aircraft are about to get too close to each other. The performance of the conflict alert function is a key element to the overall functioning of the air traffic control system. A set of metrics ...

متن کامل

Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time

In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...

متن کامل

Conflicts in Generalised Modular Logic Programming

Modularity has been studied extensively in conventional logic programming and incorporating modularity into Answer Set Programming has also become popular in the last few years. A major approach is Oikarinnen and JanhunenÕs Gaifman-Shapiro-style architecture of program modules, which provides the composition of program modules. Recently one shortcoming to their approach, imposed in order to ens...

متن کامل

Polynomial-Time Learning in Logic Programming and Constraint Logic Programming

Induction in rst-order logic languages suuers from an additional factor of complexity compared to induction in attribute-value languages: the number of possible matchings between a candidate hypothesis and a training example. This paper investigates the use of a stochastic bias to control this factor of complexity: the exhaustive exploration of the matching space is replaced by considering a xe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research Letters

سال: 2021

ISSN: ['0167-6377', '1872-7468']

DOI: https://doi.org/10.1016/j.orl.2021.05.001